Algorithms and biplots for double constrained correspondence analysis
نویسندگان
چکیده
منابع مشابه
Seriation by constrained correspondence analysis: A simulation study
One of the many areas in which Correspondence Analysis (CA) is an effective method, concerns ordination problems. For example, CA is a well-known technique for the seriation of archaeological assemblages. A problem with the CA seriation solution, however, is that only a relative ordering of the assemblages is obtained. To improve the usual CA solution, a constrained CA approach that incorporate...
متن کاملModi...ed biplots for enhancing two-class discriminant analysis
When applied to discriminant analysis (DA) biplot methodology leads to useful graphical displays for describing and quantifying multidimensional separation and overlap among classes. The principles of ordinary scatterplots are extended in these plots by adding information of all variables on the plot. However, we show that there are fundamental di¤erences between two-class DA problems and the c...
متن کاملMulti-trait Selection in Sunflower Hybrids using Double and Triple Biplots
Extended Abstract Introduction and Objective: The selection of high-yielding genotypes is especially important in sunflower. Therefore, this study was conducted to identify interrelationships between different traits and the selection of the best sunflower hybrids. Material and Methods: In this study, 11 new hybrids along with four cultivars Golsa, Ghasem, Shams, and Farrokh were evaluated in...
متن کاملBiplots for matched two-way tables
— This paper is an investigation into the exploratory analyses of matched two-way tables and their biplot visualizations. In doing so, we revisit the singular value decomposition of real and complex matrices. It is shown how standard methods, initially derived for the analysis of square tables, extend to this more general setting. The modeling interpretation of these biplots is also elicited. (...
متن کاملAlgorithms for 3D Isometric Shape Correspondence
There are many pairs of objects in the digital world that need to be related before performing any comparison, transfer, or analysis in between. The shape correspondence algorithms essentially address this problem by taking two shapes as input with the aim of finding a mapping that couples similar or semantically equivalent surface points of the given shapes. We focus on computing correspondenc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Environmental and Ecological Statistics
سال: 2018
ISSN: 1352-8505,1573-3009
DOI: 10.1007/s10651-017-0395-x